An Interface Algebra for the Relational Nets
نویسندگان
چکیده
We present two interface algebras with their corresponding implementation relation that are interface theories for the relational nets. Toghether with a formal and thorough description of these interface algebras, we provide a proof of this claim. Moreover, we also accentuate non-triviality and expressiveness of our solution.
منابع مشابه
Interface Theory for Relational Nets
In this paper we show that a maximally expressive interface theory can be obtained for any component algebra by inverting the hierarchy relation. It is demonstrated that including the full I/O relation of the components in the interfaces might be necessary if the interface theory is to be able to express all the behaviors of relational nets. An instance of a minimally expressive interface theor...
متن کاملRealtion-Algebraic Analysis of Petri Nets with RELVIEW
We present a method for specifying and implementing algorithms for the analysis of Petri nets. It is formally grounded in relational algebra. Speciications are written in ordinary predicate logic and then transformed systematically into relational programs which can be executed directly in RELVIEW, a graphical computer system for calculating with relations. Our method yields programs that are c...
متن کاملCombinatorial Strand Algebra in Insertion Modeling System
This article is focused on the Insertion Modeling System developed by A.A. Letichevsky of the department 100/105 of the Glushkov Institute of Cybernetics, National Academy of Science of Ukraine, Kyiv, Ukraine Insertion Modeling System (IMS)[1] is buit on the Algebraic Programming System (APS) that also was developed by A.A. Letichevsky in 1987. and on the way of implementation of strand algebra...
متن کاملRunning CLEF-IP Experiments using a Graphical Query Builder
The CWI submission for the CLEF-IP track shows results for out-of-the-box querying using a graphical strategy design interface. This domain-independent search platform has been enriched with patent-specific information, which was then readily available to the query interface. The search strategies for the 4 runs submitted have been constructed by simple drag&drop operations in this graphical in...
متن کاملTranslating Orc Features into Petri Nets and the Join Calculus
Cook and Misra’s Orc is an elegant language for orchestrating distributed services, able to cover e.g. van der Aalst’s workflow patterns. We aim to understand the key novel features of Orc by comparing it with variations of Petri nets. The comparison shows that Orc hides powerful mechanisms for name handling (creation and passing) and for atomic distributed termination. Petri nets with static t...
متن کامل